package src.leetcode.dp.medium_0309;

public class maxProfit {
    public static void main(String[] args) {
        Solution solution = new Solution();
        System.out.println(solution.maxProfit(new int[]{1,2,3,0,2}));
    }
}

class Solution {
    public int maxProfit(int[] prices) {
        int n = prices.length;
        if (n == 0) return 0;
        int [][]dp = new int[n][4];
        dp[0][0] = -prices[0];
        for(int i = 1; i < n; i++) {
            dp[i][0] = Math.max(Math.max(dp[i-1][0], dp[i-1][3] - prices[i]),dp[i - 1][1] - prices[i]);
            dp[i][1] = Math.max(dp[i-1][1], dp[i-1][3]);
            dp[i][2] = dp[i - 1][0] + prices[i];
            dp[i][3] = dp[i - 1][2];
        }
        return Math.max(Math.max(dp[n-1][1], dp[n-1][2]),dp[n - 1][3]);
    }
}